Raptor Codes and Cryptographic Issues

نویسنده

  • Mikko Malinen
چکیده

In this paper two cryptographic methods are introduced. In the first method the precence of a certain size subgroup of persons can be checked for an action to take place. For this we use fragments of Raptor codes delivered to the group members. In the other method a selection of a subset of objects can be made secret. Also, it can be proven afterwards, what the original selection was.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Redundancy Hybrid ARQ with LDPC and Raptor Codes

Two incremental redundancy hybrid ARQ (IR-HARQ) schemes are proposed, analyzed, and compared: one is based on LDPC code ensembles with random transmission assignments, the other is based on recently introduced Raptor codes. A number of important issues, such as rate and power control, Raptor code design, and error rate performance after each transmission on time varying binary-input, symmetrico...

متن کامل

Systematic Raptor Codes for Safety Broadcast in an Unsaturated Vehicular Highway Environment

Active safety broadcast is one of the most fundamental services in intelligent transportation systems. The repetition code proposed in wireless access for vehicular environment (WAVE) standard is inefficient in realistic channel conditions and rapidly changing network topologies. In this study, we propose the use of systematic raptor codes as a forward error correction (FEC) scheme at the MAC l...

متن کامل

Jointly Decoded Raptor Codes: Analysis and Design for the BIAWGN Channel

We are interested in the analysis and optimization of Raptor codes under a joint decoding framework, that is, when the precode and the fountain code exchange soft information iteratively. We develop an analytical asymptotic convergence analysis of the joint decoder, derive an optimization method for the design of efficient output degree distributions, and show that the new optimized distributio...

متن کامل

Corruption Resilient Fountain Codes

A new aspect for erasure coding is considered, namely, the possibility that some portion of the arriving packets are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths that are leading to the receiver and are controlled by an adversary. Alternatively, in case packets are collected from several sources, the corruptio...

متن کامل

Analyse asymptotique et conception robuste de codes Raptor pour le décodage conjoint

In this paper, we consider the joint decoding of Raptor codes on a binary input additive white Gaussian noise channel. Raptor codes are rateless fountain codes that have the attractive property of being universal on the binary erasure channel: they can approach arbitrarily close the capacity, independently of the channel parameter. It has been recently shown that Raptor codes are not universal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0811.0952  شماره 

صفحات  -

تاریخ انتشار 2008